Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree
نویسندگان
چکیده
منابع مشابه
META-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملA Study of Pedestrian Movement on Crosswalks Based on Chaos Theory
Walking, as an important transportation mode, plays a large part in urban transportation systems. This mode is of great importance for planners and decision-makers because of its impact on environmental and health aspects of communities. However, this mode is so complex in nature that makes it difficult to study or model. On the other hand, chaos theory studies complex dynamical nonlinear syste...
متن کاملPlanar Decompositions and the Crossing Number of Graphs with an Excluded Minor
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that every graph that excludes a fixed graph as a minor has a planar decomposition with bounded width and a linear number of bags. The crossing number of a graph is ...
متن کاملToroidal Grid Minors and Stretch in Embedded Graphs∗
1 We investigate the toroidal expanse of an embedded graph G, that is, the size of the largest 2 toroidal grid contained in G as a minor. In the course of this work we introduce a new embedding 3 density parameter, the stretch of an embedded graph G, and use it to bound the toroidal 4 expanse from above and from below within a constant factor depending only on the genus and 5 the maximum degree...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 36 شماره
صفحات -
تاریخ انتشار 2001